An improved method for solving multiple-sets split feasibility problem
نویسندگان
چکیده
منابع مشابه
Some Explicit and Hybrid Strong Convergence Algorithms for Solving the Multiple-Sets Split Feasibility Problem
In this paper, we present several explicit and hybrid strong convergence algorithms for solving the multiple-sets split feasibility problem (MSSFP). Firstly, we modify the existing successive, parallel and cyclic algorithms with the hybrid steepest descent method; then two new hybrid formulas based on the Mann type method are presented; Two general hybrid algorithms which can cover the former o...
متن کاملA Modified Algorithm for Solving the Split Feasibility Problem
In this paper a modified algorithm for solving the split feasibility problem (SFP) is presented. This algorithm uses the generalized Armijo line search in computing predictor step size and gives a correction step rule in the iterative process, which makes an accelerated convergence to the solution of SFP. Meanwhile, it needs not to compute the matrix inverses and the large eigenvalue of the mat...
متن کاملAn improved version of Chubanov’s method for solving a homogeneous feasibility problem
We deal with a recently proposed method of Chubanov [1] for solving linear homogeneous systems with positive variables. Some improvements of Chubanov’s method and its analysis are presented. We propose a new and simple cut criterion and show that the cuts defined by the new criterion are at least as sharp as in [1]. The new cut criterion reduces the iteration bound for his Basic Procedure by a ...
متن کاملSelf-Adaptive and Relaxed Self-Adaptive Projection Methods for Solving the Multiple-Set Split Feasibility Problem
and Applied Analysis 3 half-spaces, so that the algorithm is implementable. We need not estimate the Lipschitz constant and make a sufficient decrease of the objection function at each iteration; besides, these projection algorithms can reduce to the modifications of the CQ algorithm 6 when the MSSFP 1.1 is reduced to the SFP. We also show convergence the algorithms under mild conditions.
متن کاملPerturbed Projections and Subgradient Projections for the Multiple-Sets Split Feasibility Problem
We study the multiple-sets split feasibility problem that requires to find a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. By casting the problem into an equivalent problem in a suitable product space we are able to present a simultaneous subgradients proj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2012
ISSN: 1687-1812
DOI: 10.1186/1687-1812-2012-168